Network Reconfiguration with Orientation-Dependent Transit Times

Motivated by applications in evacuation planning, we consider a problem of optimizing flow with arc reversals which the transit time depends on orientation arc. In considered problems, an may change when it is reversed, contrary to problems existing literature. Extending idea auxiliary network construction allow asymmetric arcs, present strongly polynomial algorithms for solving single-source-single-sink maximum dynamic contraflow and quickest problem. The results are substantiated computational experiment Kathmandu road network. An algorithm solve corresponding earliest arrival pseudo-polynomial-time complexity also presented. partial approach has been discussed.